Constrained convex bodies with extremal affine surface areas
نویسندگان
چکیده
منابع مشابه
Rényi Divergence and Lp-affine surface area for convex bodies
We show that the fundamental objects of the Lp-Brunn-Minkowski theory, namely the Lp-affine surface areas for a convex body, are closely related to information theory: they are exponentials of Rényi divergences of the cone measures of a convex body and its polar. We give geometric interpretations for all Rényi divergences Dα, not just for the previously treated special case of relative entropy ...
متن کاملAffine surface area and convex bodies of elliptic type
If a convex body K in R is contained in a convex body L of elliptic type (a curvature image), then it is known that the affine surface area of K is not larger than the affine surface area of L. We prove that the affine surface areas of K and L can only be equal if K = L. 2010 Mathematics Subject Classification: primary 52A10; secondary 53A15
متن کاملWidth-integrals and Affine Surface Area of Convex Bodies
The main purposes of this paper are to establish some new Brunn– Minkowski inequalities for width-integrals of mixed projection bodies and affine surface area of mixed bodies, together with their inverse forms.
متن کاملAffine Diameters of Convex Bodies
We prove sharp inequalities for the average number of affine diameters through the points of a convex body K in Rn. These inequalities hold if K is a polytope or of dimension two. An example shows that the proof given in the latter case does not extend to higher dimensions. The example also demonstrates that for n ≥ 3 there exist norms and convex bodies K ⊂ Rn such that the metric projection on...
متن کاملExtremal Distances between Sections of Convex Bodies
Let K, D be convex centrally symmetric bodies in R. Let k < n and let dk(K, D) be the smallest Banach–Mazur distance between k-dimensional sections of K and D. Define ∆(k, n) = sup dk(K, D), where the supremum is taken over all n−dimensional convex symmetric bodies K, D. We prove that for any k < n ∆(k, n) ∼log n {√ k if k ≤ n k2 n if k > n , where A ∼log n B means that 1/(C log n) ·A ≤ B ≤ (C ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Functional Analysis
سال: 2020
ISSN: 0022-1236
DOI: 10.1016/j.jfa.2020.108531